Preemptive scheduling on uniform machines to minimize mean flow time
نویسندگان
چکیده
منابع مشابه
Preemptive scheduling on uniform machines to minimize mean flow time
In this paper we give a polynomial algorithm for problem Q | rj, pj = p, pmtn | ∑ Cj whose complexity status was open yet. The algorithm is based on a reduction of the scheduling problem to a linear program. The crucial condition for implementing the proposed reduction is the known order of job completion times.
متن کاملPreemptive Scheduling of Uniform Machines by Ordinary Network Flow Techniques*
We consider the problem of scheduling n jobs, each with a specific processing requirement, release time and due date on m uniform parallel machines. It is shown that a feasible schedule can be obtained by determining the maximum flow in a network, thus permitting the use of standard network flow codes. Using a specialized maximum flow procedure, the complexity reduces to O(tn3) operations when ...
متن کاملScheduling on uniform parallel machines to minimize maximum lateness
We consider the uniform parallel machine scheduling problem with the objective of minimizing maximum lateness. We show that an extension of the EDD rule to a uniform parallel machine setting yields a maximum lateness value which does not exceed the optimal value by more than pmax, where pmax is the maximum job processing time. c © 2000 Elsevier Science B.V. All rights reserved.
متن کاملA note on NP-hardness of preemptive mean flow-time scheduling for parallel machines
In the paper “The complexity of mean flow time scheduling problems with release times”, by Baptiste, Brucker, Chrobak, Dürr, Kravchenko and Sourd, the authors claimed to prove strong NP-hardness of the scheduling problem P |pmtn, rj | ∑ Cj , namely multiprocessor preemptive scheduling where the objective is to minimize the mean flow time. We point out a serious error in their proof and give a n...
متن کاملDedicated Scheduling of Biprocessor Tasks to Minimize Mean Flow Time
This paper investigates the complexity of scheduling biprocessor tasks on dedicated processors to minimize mean flow time. Since the general problem is strongly NP-hard, we assume some restrictions on task lengths and the structure of associated scheduling graphs. Of particular interest are acyclic graphs. In this way we identify a borderline between NP-hard and polynomially solvable special ca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Operations Research
سال: 2009
ISSN: 0305-0548
DOI: 10.1016/j.cor.2008.12.010